Large Cayley digraphs of given degree and diameter from sharply t-transitive groups
نویسندگان
چکیده
We construct a family of Cayley digraphs of degree d, diameter k and order kbd/2ck for any d ≥ 4 and k ≥ 3. We also present a collection of bipartite Cayley digraphs of order at least (k − 1)bd/2ck−1 for any degree d ≥ 4 and diameter k ≥ 4. For sufficiently large d and k, our digraphs are the largest known Cayley digraphs of degree d and diameter k, where k 6= d − 1 or d, and our bipartite digraphs are the largest known bipartite Cayley digraphs.
منابع مشابه
Moore graphs and beyond: A survey of the degree/diameter problem
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. General upper bounds – called Moore bounds – for the order of such graphs and digraphs are attainable only for certain special graphs and digraphs. Finding better (tighter) upper bounds for the maximum possible number of vertices, given the other two parameters, and thus attack...
متن کاملLarge Cayley digraphs and bipartite Cayley digraphs of odd diameters
Let Cd,k be the largest number of vertices in a Cayley digraph of degree d and diameter k, and let BCd,k be the largest order of a bipartite Cayley digraph for given d and k. For every degree d ≥ 2 and for every odd k we construct Cayley digraphs of order 2k ( ⌊d2⌋ )k and diameter at most k, where k ≥ 3, and bipartite Cayley digraphs of order 2(k − 1) ( ⌊d2⌋ )k−1 and diameter at most k, where k...
متن کاملLarge Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
For any d ≥ 5 and k ≥ 3 we construct a family of Cayley graphs of degree d, diameter k, and order at least k((d−3)/3)k. By comparison with other available results in this area we show that, for all sufficiently large d and k, our family gives the current largest known Cayley graphs of degree d and diameter k.
متن کاملLarge vertex-transitive and Cayley graphs with given degree and diameter
We present an upper bound on the number of vertices in graphs of given degree and diameter 3 that arise as lifts of dipoles with voltage assignments in Abelian groups. Further, we construct a family of Cayley graphs of degree d = 3m− 1 and diameter k ≥ 3 of order kmk. By comparison with other available results in this area we show that, for sufficiently large d and k such that k ≤ d − 2, our fa...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2010